A Solution To A Problem Of Popper

نویسنده

  • REFERENCESA. R. Anderson
چکیده

plus a principle of indirect proof for atomic sentences"(p. 244), and \one may doubt whether this is the proper way of analysing classical inferences"(p. 244{245). Prawitz suggested that a good candidate for this role could be the classical sequent calculus, since its rules are \closer to the classical meaning of the logical constants"(p. 245). More recently this criticism of natural deduction has been taken up and extended by Girard, Lafont and Taylor 1989 and Cellucci 1992. 7 This does not apply, however, to the multi-conclusion system proposed by Cellucci 1992 which is, in fact, a mixture of natural deduction and sequent calculus. 10 A proof system S 0 p-simulates another proof system S if there exists a polynomial p such that for every tautology T, if there is an S-proof of T, then there is also an S 0-proof 0 of T such that j 0 j p(jj), where jj indicates the length of proof (i.e. the number of symbols in it). This approach to classifying the complexity of proof-systems dates back to Cook and Rechow 1974 and 1979. For a recent textbook based on this approach see Eder 1992. 11 By this we mean that their search can be easily mechanized by means of standard techniques. 12 There is a three-valued semantics which validates all the rules of the classical sequent calculus, but not the cut rule. Since the cut-free sequent calculus and the calculus with cut prove exactly the same sequents, this three-valued semantics characterizes the same set of theorems as the standard two-valued one. For a discussion see Given the close correspondence between the cut-free sequent calculus and the tableau method (see Smullyan 1968), this discussion applies also to the tableau method. F P The last of these rules is the classical reductio ad absurdum referred to in the text. Another variant of the classical calculus is described in Tennant 1978 where the author uses the following classical rule of dilemma: P ] Q :P ] Q Q TABLEAU RULES 5 We assume the reader is familiar with both the tableau method and natural deduction (in its several variants). For the reader's convenience the rules of these systems are listed in the Appendix. For the tableau method see Smullyan 1968, for natural deduction and its variants see Prawitz 1965 and Tennant 1978. All currently used introductory textbooks are based on one or the other of these two …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hölder continuity of solution maps to a parametric weak vector equilibrium problem

In this paper, by using a new concept of strong convexity, we obtain sufficient conditions for Holder continuity of the solution mapping for a parametric weak vector equilibrium problem in the case where the solution mapping is a general set-valued one. Without strong monotonicity assumptions, the Holder continuity for solution maps to parametric weak vector optimization problems is discussed.

متن کامل

Optimal Solution in a Constrained Distribution System

We develop a method to obtain an optimal solution for a constrained distribution system with several items and multi-retailers. The objective is to determine the procurement frequency as well as the joint shipment interval for each retailer in order to minimize the total costs. The proposed method is applicable to both nested and non-nested policies and ends up with an optimal solution. To solv...

متن کامل

A Hybrid Solution Approach Based on Benders Decomposition and Meta-Heuristics to Solve Supply Chain Network Design Problem

Supply Chain Network Design (SCND) is a strategic supply chain management problem that determines its configuration. This mainly focuses on the facilities location, capacity sizing, technology selection, supplier selection, transportation, allocation of production and distribution facilities to the market, and so on. Although the optimal solution of the SCND problem leads to a significant reduc...

متن کامل

An Improved Tabu Search Algorithm for Job Shop Scheduling Problem Trough Hybrid Solution Representations

Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...

متن کامل

A Pragmatic Solution to the Value Problem of Knowledge

We value possessing knowledge more than true belief. Both someone with knowledge and someone with a true belief possess the correct answer to a question. Why is knowledge more valuable than true belief if both contain the correct answer? I examine the philosophy of American pragmatist John Dewey and then I offer a novel solution to this question often called the value problem of knowledge. I pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995